منابع مشابه
FUZZY HV -SUBSTRUCTURES IN A TWO DIMENSIONAL EUCLIDEAN VECTOR SPACE
In this paper, we study fuzzy substructures in connection withHv-structures. The original idea comes from geometry, especially from thetwo dimensional Euclidean vector space. Using parameters, we obtain a largenumber of hyperstructures of the group-like or ring-like types. We connect,also, the mentioned hyperstructures with the theta-operations to obtain morestrict hyperstructures, as Hv-groups...
متن کاملParallel Transport Frame in 4 -dimensional Euclidean Space
In this work, we give parallel transport frame of a curve and we introduce the relations between the frame and Frenet frame of the curve in 4-dimensional Euclidean space. The relation which is well known in Euclidean 3-space is generalized for the rst time in 4-dimensional Euclidean space. Then we obtain the condition for spherical curves using the parallel transport frame of them. The conditi...
متن کاملComputability on Regular Subsets of Euclidean Space
For the computability of subsets of real numbers, several reasonable notions have been suggested in the literature. We compare these notions in a systematic way by relating them to pairs of ‘basic’ ones. They turn out to coincide for full-dimensional convex sets; but on the more general class of regular sets, they reveal rather interesting ’weaker/stronger’ relations. This is in contrast to sin...
متن کاملfuzzy hv -substructures in a two dimensional euclidean vector space
in this paper, we study fuzzy substructures in connection withhv-structures. the original idea comes from geometry, especially from thetwo dimensional euclidean vector space. using parameters, we obtain a largenumber of hyperstructures of the group-like or ring-like types. we connect,also, the mentioned hyperstructures with the theta-operations to obtain morestrict hyperstructures, as hv-groups...
متن کاملReporting Neighbors in High-Dimensional Euclidean Space
We consider the following problem, which arises in many database and web-based applications: Given a set P of n points in a high-dimensional space R and a distance r, we want to report all pairs of points of P at Euclidean distance at most r. We present two randomized algorithms, one based on randomly shifted grids, and the other on randomly shifted and rotated grids. The running time of both a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1979
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1979-0521896-8